Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings
نویسندگان
چکیده
This note characterizes the dynamic structure of stable matchings of the stable marriage problem (SMP). The characterization focuses on the dynamic process of how the stable matching will be attained. To this end, the discrete problem of the SMP will be mapped to nonlinear dynamical models whose attractors include the counterparts of the stable matchings in the original SMP. A simple measure of decision-making difficulty is introduced. We use two types of diagram: a cross section diagram (and its 3D imaging) of a lattice to visualize the decision-making difficulty, and a radiation diagram to visualize the time evolution to a matching. Both diagrams are used to examine the dynamic structure of the neighborhood of an attractor and its basin as well as the region between basins in the dynamical model mapped from the SMP. © 2013 Yoshiteru Ishida. Published by Elsevier B.V. Selection and peer-review under responsibility of KES International.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملStable matchings and linear programming
THE stable matching problem was introduced by Gale and Shapley as a model of how to assign students to colleges. It is a classic that has inspired a flood of papers exploring generalizations, variations and applications. For a comprehensive account of these, see Roth and Sotomayor as well as Roth. A stable matching is a matching in a bipartite graph that satisfies additional conditions. Just as...
متن کاملSocial Networks and Stable Matchings in the Job Market
For most people, social contacts play an integral part in finding a new job. As observed by Granovetter’s seminal study, the proportion of jobs obtained through social contacts is usually large compared to those obtained through postings or agencies. At the same time, job markets are a natural example of two-sided matching markets. An important solution concept in such markets is that of stable...
متن کاملThe center stable matchings and the centers of cover graphs of distributive lattices
Let I be an instance of the stable marriage (SM) problem. In the late 1990s, Teo and Sethuraman discovered the existence of median stable matchings, which are stable matchings that match all participants to their (lower/upper) median stable partner. About a decade later, Cheng showed that not only are they locally-fair, but they are also globally-fair in the following sense: when G(I) is the co...
متن کاملStable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median stable partner. Moreover, for SM instances, a stable matching has this property if and only if it is a median of the distributive lattice formed by the instance’s stable matchings. In this paper, we show that the above...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013